|
|
Transducer Systems and Their Applications
Lupták, Filip ; Krčmář, Radim (referee) ; Meduna, Alexandr (advisor)
This thesis defines a new formal model „transducer system." Transducer system is composed of a number of finite transducers, which cooperate. The thesis examines expressive power of this formal model and shows that transducer system is more powerful than isolated finite transducer. This model is then used to design a parser of arithmetic expressions, which translates them to postfix notation.
|
|
|
Solver of Mathematical Equations for Android
Janičko, Adam ; Herout, Adam (referee) ; Zachariáš, Michal (advisor)
This thesis aims at creating equation solver application for Android platform. The thesis includes graphical user interface (GUI), save and edit options for equations, the actual equation solving and widget for quickly evaluating already stored equations. When creating equations, user is able to use selected mathematical functions, constants and custom variables that user can define right before evaluation. The equation in the standard infix notation inappropriate for further processing is transferred to the prefix notation using modified Shunting Yard algorithm. Final expression is put together once. That means the evaluation is faster, when the values of user-defined variables changes.
|
|
|
Transducer Systems and Their Applications
Boros, Adrián ; Dvořák, Tomáš (referee) ; Meduna, Alexandr (advisor)
This thesis introduces a new variant of translation devices. We propose a new formal model based on the interconnection of several cooperating pushdown transducers. This new model is called transducer system. The principle of operation of these systems is similar to the cooperating distributed (CD) grammar systems, enabling a cooperation of several grammar over a common sentential form. Furthermore, the thesis deals with the computational power of this formal model. The main result is an application that converts arithmetic expressions from infix to postfix notation.
|
|
|
Transducer Systems and Their Applications
Boros, Adrián ; Dvořák, Tomáš (referee) ; Meduna, Alexandr (advisor)
This thesis introduces a new variant of translation devices. We propose a new formal model based on the interconnection of several cooperating pushdown transducers. This new model is called transducer system. The principle of operation of these systems is similar to the cooperating distributed (CD) grammar systems, enabling a cooperation of several grammar over a common sentential form. Furthermore, the thesis deals with the computational power of this formal model. The main result is an application that converts arithmetic expressions from infix to postfix notation.
|
|
|
Transducer Systems and Their Applications
Lupták, Filip ; Krčmář, Radim (referee) ; Meduna, Alexandr (advisor)
This thesis defines a new formal model „transducer system." Transducer system is composed of a number of finite transducers, which cooperate. The thesis examines expressive power of this formal model and shows that transducer system is more powerful than isolated finite transducer. This model is then used to design a parser of arithmetic expressions, which translates them to postfix notation.
|
|
|
Solver of Mathematical Equations for Android
Janičko, Adam ; Herout, Adam (referee) ; Zachariáš, Michal (advisor)
This thesis aims at creating equation solver application for Android platform. The thesis includes graphical user interface (GUI), save and edit options for equations, the actual equation solving and widget for quickly evaluating already stored equations. When creating equations, user is able to use selected mathematical functions, constants and custom variables that user can define right before evaluation. The equation in the standard infix notation inappropriate for further processing is transferred to the prefix notation using modified Shunting Yard algorithm. Final expression is put together once. That means the evaluation is faster, when the values of user-defined variables changes.
|
guest ::
